Optimal steady states, excessive functions, and deterministic dynamic programs

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES

In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...

متن کامل

Irreversible processes at nonequilibrium steady states and Lyapounov functions.

Nonequilibrium stability theory is reviewed. In answer to recent comments by Fox [Fox, R. F. (1979) Proc. Natl. Acad. Sci. USA 76, 2114-2117], it is pointed out that various choices of Lyapounov functions are possible in the nonlinear range of irreversible phenomena.

متن کامل

On Automatic Seeking of Optimal Steady-states in Biochemical Processes

It is discussed how the automatic seeking of optimal steady states in biochemical reactors can be achieved by using non-model based extremum-seeking control with semi-global practical stability and convergence properties. A special attention is paid to processes with multiple steady-states and multivalued cost functions. Copyright c ©IFAC 2007

متن کامل

Optimal Control of Transitions between Nonequilibrium Steady States

Biological systems fundamentally exist out of equilibrium in order to preserve organized structures and processes. Many changing cellular conditions can be represented as transitions between nonequilibrium steady states, and organisms have an interest in optimizing such transitions. Using the Hatano-Sasa Y-value, we extend a recently developed geometrical framework for determining optimal proto...

متن کامل

Dynamic Detection of Deterministic Computations in Non-Deterministic Functional-Logic Programs

The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1989

ISSN: 0022-247X

DOI: 10.1016/0022-247x(89)90353-3